Solving the combinatorial double auction problem
نویسندگان
چکیده
Department of Business Administration, The University of Illinois at Urbana-Champaign, Champaign IL 61820, USA Operations and Information Management Department, School of Business, University of Connecticut, Storrs, CT 06269, USA Center for Research in Electronic Commerce, McCombs School of Business, The University of Texas at Austin, Austin TX 78712-1175, USA [email protected] • [email protected] • [email protected]
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملSolving Winner Determination Problem in Double Combinatorial Auction by ICA in Cloud Computing
There are many different ways to allocate resources in cloud computing. The economic methods are some of common ways to resource allocation. The auction-based method has some advantages compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. Resource allocation in double combinatorial auction includes two phases. Th...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملInterfaces with Other Disciplines Solving the combinatorial double auction problem q
This paper studies the solution of several types of combinatorial (double) auctions. Such auctions have recently been used in business-to-business trading in a centralized marketplace, or in multi-agent coordination systems in artificial intelligence. When the goods are indivisible, solving the winner determination problem (WDP) is an integer programming problem and NP-hard in its general form....
متن کاملCombinatorial Double Auction Winner Determination in Cloud Computing using Hybrid Genetic and Simulated Annealing Algorithm
With the advancement of information technology need to perform computing tasks everywhere and all the time there, in cloud computing environments and heterogeneous users have access to different sources with different characteristics that these resources are geographically in different areas. Due to this, the allocation of resources in cloud computing comes to the main issue is considered a maj...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 164 شماره
صفحات -
تاریخ انتشار 2005